Sparse non Gaussian component analysis by semidefinite programming
نویسندگان
چکیده
منابع مشابه
Sparse Approximation by Semidefinite Programming
The problem of sparse approximation and the closely related compressed sensing have received tremendous attention in the past decade. Primarily studied from the viewpoint of applied harmonic analysis and signal processing, there have been two dominant algorithmic approaches to this problem: Greedy methods called the matching pursuit (MP) and the linear programming based approaches called the ba...
متن کاملOn the Quality of a Semidefinite Programming Bound for Sparse Principal Component Analysis
We examine the problem of approximating a positive, semidefinite matrix Σ by a dyad xxT , with a penalty on the cardinality of the vector x. This problem arises in sparse principal component analysis, where a decomposition of Σ involving sparse factors is sought. We express this hard, combinatorial problem as a maximum eigenvalue problem, in which we seek to maximize, over a box, the largest ei...
متن کاملGenerating Non-linear Interpolants by Semidefinite Programming
Interpolation-based techniques have been widely and successfully applied in the verification of hardware and software, e.g., in bounded-model checking, CEGAR, SMT, etc., whose hardest part is how to synthesize interpolants. Various work for discovering interpolants for propositional logic, quantifier-free fragments of first-order theories and their combinations have been proposed. However, litt...
متن کاملA Direct Formulation for Sparse PCA Using Semidefinite Programming
Given a covariance matrix, we consider the problem of maximizing the variance explained by a particular linear combination of the input variables while constraining the number of nonzero coefficients in this combination. This problem arises in the decomposition of a covariance matrix into sparse factors or sparse PCA, and has wide applications ranging from biology to finance. We use a modificat...
متن کاملA Low-Complexity Parallelizable Numerical Algorithm for Sparse Semidefinite Programming
Abstract—In the past two decades, the semidefinite programming technique has been proven to be extremely successful in the convexificiation of hard optimization problems appearing in graph theory, control theory, polynomial optimization theory, and many areas in engineering. In particular, major power optimization problems, such as optimal power flow, state estimation and unit commitment, can b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Machine Learning
سال: 2013
ISSN: 0885-6125,1573-0565
DOI: 10.1007/s10994-013-5331-1